A Comparison of Different Contraction Methods for Monotone Variational Inequalities
نویسندگان
چکیده
It is interesting to compare the efficiency of two methods when their computational loads in each iteration are equal. In this paper, two classes of contraction methods for monotone variational inequalities are studied in a unified framework. The methods of both classes can be viewed as prediction-correction methods, which generate the same test vector in the prediction step and adopt the same step-size rule in the correction step. The only difference is that they use different search directions. The computational loads of each iteration of the different classes are equal. Our analysis explains theoretically why one class of the contraction methods usually outperforms the other class. It is demonstrated that many known methods belong to these two classes of methods. Finally, the presented numerical results demonstrate the validity of our analysis. Mathematics subject classification: 65K10, 90C25, 90C30.
منابع مشابه
A Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Solutions of variational inequalities on fixed points of nonexpansive mappings
n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.
متن کاملOn the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
Recently, Nemirovski’s analysis indicates that the extragradient method has the O(1/t) convergence rate for variational inequalities with Lipschitz continuous monotone operators. For the same problems, in the last decades, we have developed a class of Fejér monotone projection and contraction methods. Until now, only convergence results are available to these projection and contraction methods,...
متن کاملProximal-like contraction methods for monotone variational inequalities in a unified framework1
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. To solve the subproblems of these algorithms, the projection method takes the iteration in form of uk+1 = PΩ[u − αkd]. Interestingly, many of them can be paired such that ũk = PΩ[u − βkF (vk)] = PΩ[ũ − (d2 − Gd1)], where inf{βk} > 0 and G ...
متن کامل